Window boxes?

Boxes: A Symbolic Abstract Domain of Boxes

Numeric abstract domains are widely used in program analyses. The simplest numeric domains over-approximate disjunction by an imprecise join, typically yielding path-insensitive analyses. This problem is addressed by domain refinements, such as finite powersets, which provide exact disjunction. However, developing correct and efficient disjunctive refinement is challenging. First, there must be...

Black Boxes

The non-structure theorems we have discussed in Chapter III rests usually on some freedom on finite sequences and on a kind of order. When our freedom is related to infinite sequences, and to trees, our work is sometimes harder. In particular, we may consider, for λ ≥ χ, χ regular, and φ = φ(x̄0, . . . , x̄α, . . .)α<χ in a vocabulary τ : (∗) For any I ⊆ λ we have a τ–modelMI and sequences āη (fo...

Causal Boxes and Hierar hi al Time Boxes

Enclosing Many Boxes by an Optimal Pair of Boxes

Solving Dots-And-Boxes

Dots-And-Boxes is a well-known and widely-played combinatorial game. While the rules of play are very simple, the state space for even very small games is extremely large, and finding the outcome under optimal play is correspondingly hard. In this paper we introduce a Dots-And-Boxes solver which is significantly faster than the current state-of-the-art: over an order-of-magnitude faster on seve...